The NP Search Problems of Frege and Extended Frege Proofs
نویسندگان
چکیده
منابع مشابه
Propositional Proofs in Frege and Extended Frege Systems (Abstract)
We discuss recent results on the propositional proof complexity of Frege proof systems, including some recently discovered quasipolynomial size proofs for the pigeonhole principle and the Kneser-Lovász theorem. These are closely related to formalizability in bounded arithmetic.
متن کاملCutting plane and Frege proofs
The cutting plane refutation system CP for propositional logic is an extension of resolution and is based on showing the non-existence of solutions for families of integer linear inequalities. We deene the system CP + , a modiication of the cutting plane system, and show that CP + can polynomially simulate Frege systems F. In 8], it is shown that F polynomially simulates CP + , so both systems ...
متن کاملExtended Frege and Gaussian Elimination
We show that the Gaussian Elimination algorithm can be proven correct with uniform Extended Frege proofs of polynomial size, and hence feasibly. More precisely, we give short uniform Extended Frege proofs of the tautologies that express the following: given a matrix A, the Gaussian Elimination algorithm reduces A to row-echelon form. We also show that the consequence of this is that a large cla...
متن کاملBounded Arithmetic and Constant Depth Frege Proofs
We discuss the Paris-Wilkie translation from bounded arithmetic proofs to bounded depth propositional proofs in both relativized and non-relativized forms. We describe normal forms for proofs in bounded arithmetic, and a definition of Σ -depth for PK-proofs that makes the translation from bounded arithmetic to propositional logic particularly transparent. Using this, we give new proofs of the w...
متن کاملNo Feasible Interpolation for TC0-Frege Proofs
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2017
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3060145